Analysis of Clustering Techniques in VLSI Cell Partitioning

Circuit partitioning plays a dominant role in VLSI physical design of chips. In this paper the newly proposed rank based k-medoid clustering algorithm is discussed, in order to partition the combinational circuit based on their interconnection distance among cell groups. Clustering analysis of the given circuit ,partition the set of objects into non overlapping subsets. The proposed ranked k-medoid clustering algorithm method reduces the size of the interconnections distance and also speed up the large scale partitioning problems without any reduction of partitioning accuracy. The ranked K-medoid algorithm has overcome the local optimum problem and has showed the improved result when it is compared with K-mean and K-medoid clustering algorithm.